Ntru: a Public Key Cryptosystem
نویسندگان
چکیده
0. Introduction 1. Description of NTRU 1.1. Notation 1.2. Key Creation 1.3. Encryption 1.4. Decryption 1.5. Why Decryption Works 1.6. Parameter choices notation and a norm estimate 1.7. Sample spaces 1.8. A Decryption Criterion 2. Attributes and Advantages of NTRU 2.1. Theoretical Operating Speci cations 2.2. Comparison With Other PKCS's 3. Security Considerations 3.1. Security Analysis 3.2. Brute force attacks 3.3. Meet-in-the-middle attacks 3.4. Multiple transmission attacks 3.5. Semantic security 3.6. Lattice based attacks 3.6.1. Lattice attack on an NTRU private key 3.6.2. Lattice attack on an NTRU message 3.6.3. Lattice attack on a spurious key 3.6.4. Experimental results 3.6.5. Zero-forced lattices 3.7. Practical Implementations of NTRU Speci c Parameter Choices 4. Known Limitations and Disadvantages 5. Intellectual Property Issues
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملNTRU: A Ring-Based Public Key Cryptosystem
We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing syst...
متن کاملMaTRU: A New NTRU-Based Cryptosystem
In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosystem, except that it operates in a different ring with a different linear transformation for encryption and decryption. In particular, it operates in the ring of k by k matrices of polynomials in R = Z[X]/(X−1), whereas NTRU oper...
متن کاملCryptanalysis of NTRU with two Public Keys
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman. It operates in the ring of truncated polynomials. In NTRU, a public key is a polynomial defined by the combination of two private polynomials. In this paper, we consider NTRU with two different public keys defined by different private keys. We present a lattice-based attack to recover the private keys a...
متن کاملPerformance and analysis of NTRU and Advanced NTRU cryptosystems
Authentication and Confidentiality is the main goal of the public key cryptosystems deal when communication takes place between both the parties. The mostly used cryptographic methods are broadly classified as symmetric and asymmetric. The DES comes under the category of symmetric key cryptosystem whereas RSA, NTRU[1] belongs to the category of asymmetric key cryptosystem. NTRU (Nth degree trun...
متن کاملNSS: The NTRU Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU public key cryptosystem. The hard lattice problem underlying NSS is similar to the hard problem underlying NTRU, and NSS similarly features high speed, low footprint, and easy key creation.
متن کامل